Bit Zipper Rendezvous
نویسندگان
چکیده
In many distributed applications, pairs of queries and values are evaluated by participating nodes. This includes keyword search for documents, selection queries on tuples, and publish-subscribe. These applications require that all values accepted by the query be evaluated. To carry out this evaluation we will present the peer-to-peer based Bit Zipper Rendezvous which partitions query-value pairs as opposed to values only. Even for problems that allow an efficient value-based partition, the Bit Zipper complements existing solutions with its generality. Where flooding to N nodes used to be the only fall-back, the Bit Zipper is a replacement needing only O( √ N). For problems requiring that all pairs be evaluated, we will show that the Bit Zipper Rendezvous is optimal.
منابع مشابه
Bit Zipper Rendezvous Optimal Data Placement for General P2P Queries
In many distributed applications, pairs of predicates and data have to be evaluated locally. This includes publish-subscribe, keyword search for documents, and selection queries on tuples. We will present the Bit Zipper Rendezvous as a peer-to-peer based solution to these problems. Though not as efficient as value-based partitioning approaches, the Bit Zipper’s generality complements them. Wher...
متن کاملZipper: A compact connectivity data structure for triangle meshes
We propose Zipper, a compact representation of incidence and adjacency for manifold triangle meshes with fixed connectivity. Zipper uses on average only 6 bits per triangle, can be constructed in linear space and time, and supports all standard randomaccess and mesh traversal operators in constant time. Similarly to the previously proposed LR (Laced Ring) approach, the Zipper construction reord...
متن کاملOptimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring
We study the rendezvous problem with k 2 mobile agents in a n-node ring. We present a new algorithm which solves the rendezvous problem for the non-symmetric distribution of agents on the ring. The mobile agents require the use of O(log k) bit-wise size of internal memory and one indistinguishable token each. In the periodic (but not symmetric) case our new procedure allows the agents to conclu...
متن کاملReliable Self-Stabilizing Communication for Quasi Rendezvous
The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours’ registers. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the...
متن کاملZipper: a duplex method for VDSL based on DMT
In this paper, we present a new duplex scheme, called Zipper, for discrete multitone (DMT)-based very high bit-rate digital subscriber line (VDSL) systems on copper wires. This scheme divides the available bandwidth by assigning different subcarriers for the upstream and downstream directions. It has high flexibility to divide the capacity between the up and downstream, as well as good coexiste...
متن کامل